Test Strategies on the Basis of Extended Finite State Machines
نویسندگان
چکیده
While testing based on finite state machines has been extensively investigated in the literature, issues concerning testing based on extended finite state machines (EFSMs) have not been adequately addressed. Such a testing is complicated due to the fact that a transition in an EFSM transforms a large (sometime infinite) set of data in contrast to just one value in a finite state machine. Moreover, it is generally not possible to recognise, which transition has occurred in an EFSM. These problems manifest themselves in the relationship between function and trace test. In this paper we discuss these problems and present as solution two strategies separate function and trace test, and combined function and trace test for testing based on an EFSM.
منابع مشابه
Restricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملOn the Combined Use of HLDDs and EFSMs for Functional ATPG
This paper describes a functional test pattern generator which exploits two different paradigms: high-level decision diagrams (HLDDs) and extended finite state machines (EFSMs). HLDDs and EFSMs are deterministically explored by using propagation, justification, learning and backjumping. The integration of such strategies allows the ATPG to more efficiently analyze the state space of the design ...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملProblems and Methods for Testing Infinite State Machines: Extended Abstract
There has been a lot of research on testing based on formal specifications, especially in the area of communication protocols. Most approaches take as starting point some finite model of the required behaviours of the system under test, such as Finite State Machines. This paper discusses the problems that arise when the underlying model of the specification is not finite.
متن کاملSelecting Test Sequences for Partially-specified Nondeterministic Finite State Machines1
In order to test the control portion of communication software, specifications are usually first abstracted to state machines, then test cases are generated from the resulting machines. The state machines obtained from the specification are often both partially-specified and nondeterministic. We come out with a method of generating test suites for the software that is modeled by partially-speci...
متن کامل